Depot shunting scheduling using combined genetic algorithm and PERT
نویسندگان
چکیده
Shunting scheduling problems at railway depot can be regarded as a sort of resource constrained project scheduling problem (RCPSP). Unlike the normal RCPSPs, however, shunting scheduling problems require that the number of activities which form a project has to be dynamically changed in the problem solving process and some of the activities have to be performed at a prescribed timing, for example. We propose an efficient algorithm for depot shunting scheduling problems combining genetic algorithm (GA) and PERT. GA and PERT are combined so that the candidates for answers in GA are evaluated by PERT. This enables us to reduce the search space of GA to a great extent. We have confirmed the effectiveness of our algorithm through several experiments using practical train schedule data.
منابع مشابه
Automatic generation of car shunting scheduling in railway car depots
A train schedule defines each train’s arrival/departure time at a car depot. Between the arrival and departure times, every train has to have its designated works, such as inspection and cleaning of the cars, completed, which are predefined by a car operation schedule. The planner of car shuntings at a car depot must create a schedule that satisfies the above-mentioned conditions, while also ta...
متن کاملLocomotive assignment problem with train precedence using genetic algorithm
This paper aims to study the locomotive assignment problem which is very important for railway companies, in view of high cost of operating locomotives. This problem is to determine the minimum cost assignment of homogeneous locomotives located in some central depots to a set of pre-scheduled trains in order to provide sufficient power to pull the trains from their origins to their destinations...
متن کاملDevelopment of Model and Algorithm for Depot Balancing Multi-Depot Vehicle Scheduling Problem Considering Depot Balancing
The main of multi-depot vehicle scheduling problem (MDVSP) is to schedule the timetabled trips using limited resources, optimally. The problem is very important in the management of the transportation systems. One of the most useful ways to better manage these systems is to consider the real conditions including depot balancing constraints. To normalize the number of vehicles departed from each...
متن کاملA Hybrid Genetic Algorithm for the Open Shop Scheduling with Makespan and Total Completion Time
Proper scheduling of tasks leads to optimum using of time and resources, in order to obtaining best result. One of the most important and complicated scheduling problems is open shop scheduling problem. There are n jobs in open shop scheduling problem which should be processed by m machines. Purpose of scheduling open shop problem is attaining to a suitable order of processing jobs by specified...
متن کاملA Hybrid Genetic Algorithm for the Open Shop Scheduling with Makespan and Total Completion Time
Proper scheduling of tasks leads to optimum using of time and resources, in order to obtaining best result. One of the most important and complicated scheduling problems is open shop scheduling problem. There are n jobs in open shop scheduling problem which should be processed by m machines. Purpose of scheduling open shop problem is attaining to a suitable order of processing jobs by specified...
متن کامل